Computing the partial word avoidability indices of binary patterns

نویسندگان

  • Francine Blanchet-Sadri
  • Andrew Lohr
  • Shane Scott
چکیده

We complete the classification of binary patterns in partial words that was started in earlier publications by proving that the partial word avoidability index of the binary pattern ABABA is two and the one of the binary pattern ABBA is three.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Partial Word Avoidability Indices of Ternary Patterns

We study pattern avoidance in the context of partial words. The problem of classifying the avoidable binary patterns has been solved, so we move on to ternary and more general patterns. Our results, which are based on morphisms (iterated or not), determine all the ternary patterns’ avoidability indices or at least give bounds for them.

متن کامل

Unary Pattern Avoidance in Partial Words Dense with Holes

A partial word is a sequence of symbols over a finite alphabet that may have some undefined positions, called holes, that match every letter of the alphabet. Previous work completed the classification of all unary patterns with respect to partial word avoidability, as well as the classification of all binary patterns with respect to non-trivial partial word avoidability. In this paper, we pose ...

متن کامل

Abelian Pattern Avoidance in Partial Words

Pattern avoidance is an important topic in combinatorics on words which dates back to the beginning of the twentieth century when Thue constructed an infinite word over a ternary alphabet that avoids squares, i.e., a word with no two adjacent identical factors. This result finds applications in various algebraic contexts where more general patterns than squares are considered. On the other hand...

متن کامل

Computational and Proof Complexity of Partial String Avoidability

The partial string avoidability problem, also known as partial word avoidability, is stated as follows: given a finite set of strings with possible “holes” (undefined symbols), determine whether there exists any two-sided infinite string containing no substrings from this set, assuming that a hole matches every symbol. The problem is known to be NP-hard and in PSPACE, and this paper establishes...

متن کامل

On the Complexity of Deciding Avoidability of Sets of Partial Words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k ≥ 2, is NP-hard [Theoret. Comput. Sci. 410 (2009) 968–972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. U...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Discrete Algorithms

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2013